Biplanar Crossing Numbers I: A Survey of Results and Problems
نویسنده
چکیده
We survey known results and propose open problems on the biplanar crossing number. We study biplanar crossing numbers of speci c families of graphs, in particular, of complete bipartite graphs. We nd a few particular exact values and give general lower and upper bounds for the biplanar crossing number. We nd the exact biplanar crossing number of K5;q for every q.
منابع مشابه
Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic method
The biplanar crossing number cr2(G) of a graph G is min{cr(G1)+ cr(G2)}, where cr is the planar crossing number and G1 ∪ G2 = G. We show that cr2(G) ≤ (3/8)cr(G). Using this result recursively, we bound the thickness by Θ(G) − 2 ≤ Kcr2(G) log2 n with some constant K. A partition realizing this bound for the thickness can be obtained by a polynomial time randomized algorithm. We show that for an...
متن کاملOn the Biplanar Crossing Number of Kn
The crossing number cr(G) of a graph G is the minimum number of edge crossings over all drawings of G in the Euclidean plane. The k-planar crossing number crk(G) of G is min{cr(G1) + cr(G2) + . . .+ cr(Gk)}, where the minimum is taken over all possible decompositions of G into k subgraphs G1, G2, . . . , Gk. The problem of computing the crossing number of complete graphs, cr(Kn), exactly for sm...
متن کاملTopological graph theory and crossing numbers
The main objective of this workshop is to bring together two groups of researchers, those working in topological graph theory and graph minors, and those working with crossing numbers. Both areas have developed methods, mathematical tools and powerful results that have great potential for being used in the other area. For instance, the most basic open problem about crossing numbers is the Turan...
متن کاملk-planar Crossing Number of Random Graphs and Random Regular Graphs
We give an explicit extension of Spencer’s result on the biplanar crossing number of the ErdősRényi random graph G(n, p). In particular, we show that the k-planar crossing number of G(n, p) is almost surely Ω((np)). Along the same lines, we prove that for any fixed k, the k-planar crossing number of various models of random d-regular graphs is Ω((dn)) for d > c0 for some constant c0 = c0(k).
متن کاملEvaluating total carrying capacity of tourism using impact indicators
The carrying capacity is well identified tool to manage problems due to uncontrolled tourism for any destination. This report highlights the carrying capacity estimation of Kerwa tourism area, Bhopal, India. The methodology used in this report is a new two-tier mechanism of impact analysis using index numbers derived from a survey of 123 stakeholders. From this the individual component impact a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006